The Nature Diagnosability of Bubble - sort Star Graphs under the PMC Model and MM * Model
نویسنده
چکیده
55 www.ijeas.org Abstract—Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. No fault set can contain all the neighbors of any fault-free vertex in the system, which is called the nature diagnosability of the system. Diagnosability of a multiprocessor system is one important study topic. As a famous topology structure of interconnection networks, the n -dimensional bubble-sort star graph n BS has
منابع مشابه
Conditional Fault Diagnosis of Bubble Sort Graphs under the PMC Model
As the size of a multiprocessor system increases, processor failure is inevitable, and fault identification in such a system is crucial for reliable computing. The fault diagnosis is the process of identifying faulty processors in a multiprocessor system through testing. The conditional diagnosability, which is a new metric for evaluating fault tolerance of such systems, assumes that every faul...
متن کاملA pr 2 01 2 Conditional Fault Diagnosis of Bubble Sort Graphs under the PMC Model ∗
As the size of a multiprocessor system increases, processor failure is inevitable, and fault identification in such a system is crucial for reliable computing. The fault diagnosis is the process of identifying faulty processors in a multiprocessor system through testing. For the practical fault diagnosis systems, the probability that all neighboring processors of a processor are faulty simultan...
متن کاملConditional Fault Diagnosis of Bubble Sort Graphs under the PMC Model.dvi
As the size of a multiprocessor system increases, processor failure is inevitable, and fault identification in such a system is crucial for reliable computing. The fault diagnosis is the process of identifying faulty processors in a multiprocessor system through testing. For the practical fault diagnosis systems, the probability that all neighboring processors of a processor are faulty simultan...
متن کاملLocal Diagnosability under the PMC Diagnosis Model with Application to Star Graphs
In this paper, we introduce a new measure of diagnosability, called local diagnosability, and provide a substructure for determining if a node is locally t-diagnosable under the PMC model. We prove that the local diagnosability of the star graph at each node is equal to its degree. Then, we propose a concept called strong local diagnosability property. We show that an n-dimensional star graph S...
متن کاملSome Properties of the g-Good-Neighbor (g-Extra) Diagnosability of a Multiprocessor System
Diagnosability of a multiprocessor system is one important study topic. In 2012, Peng et al. proposed a measure for fault tolerance of the system, which is called the g-good-neighbor diagnosability that restrains every fault-free node containing at least g fault-free neighbors. In 2015, Zhang et al. proposed a measure for fault diagnosis of the system, namely, g-extra diagnosability, which rest...
متن کامل